Availability Aware Continuous Replica Placement Problem
نویسندگان
چکیده
defined as: Given an already defined replica placement scheme, a user request profile, and a node failure profile define a new replication scheme, subject to optimization criteria and constraints. In this effort we use modified greedy heuristics from the CRPP and investigated the proposed mechanism using a trace driven java based simulation.
منابع مشابه
CPI: A Novel Three-Phase Algorithm for QoS-Aware Replica Placement Problem
QoS-aware replica placement decides how many replicas are needed and where to deploy them to meet every request from individual clients. In this paper, a novel three-phase algorithm, namely CPI, is proposed. By dividing candidate nodes into proper medium-scale partitions, CPI is capable to handle with large-scale QoS-aware replica placement problem. Pharos-based clustering algorithm obtains ide...
متن کاملThe Quality of Availability: Tackling the Replica Placement Problem
The importance of satisfying the availability of service and its data is becoming the most critical factor which decides the successfulness of the Internet-based services and applications. In this work, we take the availability issue into account as a QoS focus, and evaluate the achieved quality of a service by answering the question 'how much the service satisfies the required availability?'. ...
متن کاملQuality of availability for widely distributed and replicated content stores
As the Internet continues to experience a tremendous expansion in number of users and services today, the importance of satisfying service availability becomes recently one of the most critical factors for the success of “Internet services” such as the World Wide Web, peer-to-peer file sharing and digital audio/video streaming. In this thesis, we take an availability-centric view on end-to-end ...
متن کاملReplica Placement Strategy Based on Analytic Hierarchy Process in Heterogeneous Cloud Data Storage
Cloud data storage platforms have attracted increasing attention in data management. Data replication is a well-known technique that reduces access latency, thus improving cloud data storage availability and performance. Nonetheless, replica placement algorithms are among the significant issues in data replication, which affect data availability and access performance considerably. Replica plac...
متن کاملFormal Model and Scheduling Heuristics for the Replica Migration Problem
Replication of the most popular objects is often used in distributed data provision systems to reduce access time and improve availability. In fact, a given replica placement scheme may have to be redefined as object popularity changes. Given two replica placement schemes X and X, the Replica Migration Problem (RMP) is to compute a schedule of replica transfers and deletions that lead from X to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1605.04069 شماره
صفحات -
تاریخ انتشار 2016